basic feasible solutionの例文

• The vertices of the polytope are also called " basic feasible solutions ".
• So the inequality above excludes the basic feasible solution and thus is a cut with the desired properties.
• In this context such a point is known as a " basic feasible solution " ( BFS ).
• The possible results of Phase I are either that a basic feasible solution is found or that the feasible region is empty.
• Conversely, given a basic feasible solution, the columns corresponding to the nonzero variables can be expanded to a nonsingular matrix.
• The possible results from Phase II are either an optimum basic feasible solution or an infinite edge on which the objective function is unbounded below.
• In the second step, Phase II, the simplex algorithm is applied using the basic feasible solution found in Phase I as a starting point.
• The method proceeds by first dropping the requirement that the x i be integers and solving the associated linear programming problem to obtain a basic feasible solution.
• A basic solution that satisfies all the constraints defining P or in other words, one that lies within P is called a "'basic feasible solution " '.
• If the values of the nonbasic variables are set to 0, then the values of the basic variables are easily obtained as entries in " b " and this solution is a basic feasible solution.